A Scheduling Approach for Autonomous Vehicle Sequencing Problem at Multi-Intersections
نویسندگان
چکیده
This paper addresses the problem of scheduling autonomous vehicles to traverse several adjacent intersections with the consideration of Vehicle to Infrastructure (V2I) communication technology. Due to the combinatorial nature of the control strategy, we decentralize the problem into several isolated intersection control problems and model each of them as a special single machine scheduling problem with family jobs that can be processed simultaneously. Chain constraints and release dates are also involved. Two frequently used traffic control measures average queue length and average vehicle waiting time are modeled as the number of late jobs and total tardiness, respectively. Efficient Branch and Bound algorithms are proposed for two objectives. A heuristic that serves as initial upper bound is presented. It can also be used independently. Computational experiments and simulations show the performance gain obtained by using the proposed schemes. Keywords Intelligent vehicle control, single machine scheduling, release date, branch and bound, heuristic.
منابع مشابه
A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملAn autonomous vehicle sequencing problem at intersections: A genetic algorithm approach
This paper addresses a vehicle sequencing problem for adjacent intersections under the framework of Autonomous Intersection Management (AIM). In the context of AIM, autonomous vehicles are considered to be independent individuals and the traffic control aims at deciding on an efficient vehicle passing sequence. Since there are considerable vehicle passing combinations, how to find an efficient ...
متن کاملScheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملAutonomous Underwater Vehicle Hull Geometry Optimization Using a Multi-objective Algorithm Approach
Abstarct In this paper, a new approach to optimize an Autonomous Underwater Vehicle (AUV) hull geometry is presented. Using this methode, the nose and tail of an underwater vehicle are designed, such that their length constraints due to the arrangement of different components in the AUV body are properly addressed. In the current study, an optimal design for the body profile of a torpedo-shaped...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کامل